On normal domination of (super)martingales
نویسنده
چکیده
Let (S0, S1, . . . ) be a supermartingale relative to a nondecreasing sequence of σ-algebras (H60,H61, . . . ), with S0 6 0 almost surely (a.s.) and differences Xi := Si − Si−1. Suppose that for every i = 1, 2, . . . there exist H6(i−1)-measurable r.v.’s Ci−1 and Di−1 and a positive real number si such that Ci−1 6 Xi 6 Di−1 and Di−1−Ci−1 6 2si a.s. Then for all natural n and all functions f satisfying certain convexity conditions Ef(Sn) 6 Ef(sZ), where s := √ s1 + · · ·+ sn and Z ∼ N(0, 1). In particular, this implies P(Sn > x) 6 c5,0P(sZ > x) ∀x ∈ R, where c5,0 = 5!(e/5) = 5.699 . . . . Results for max06k6n Sk in place of Sn and for concentration of measure also follow
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملConvergence Theorems for Set Valued and Fuzzy Valued Martingales and Smartingales
The purpose of this paper is to give convergence theorems both for closed convex set valued and relative fuzzy valued martingales, and suband supermartingales. These kinds of martingales, suband super-martingales are the extension of classical real valued martingales, suband super-martingales. Here we compare two kinds of convergences, in the Hausdor metric and in the Kuratowski-Mosco sense. We...
متن کاملProbabilistic Program Analysis with Martingales
We present techniques for the analysis of infinite state probabilistic programs to synthesize probabilistic invariants and prove almost-sure termination. Our analysis is based on the notion of (super) martingales from probability theory. First, we define the concept of (super) martingales for loops in probabilistic programs. Next, we present the use of concentration of measure inequalities to b...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملSuper Strongly Perfect Ness of Some Interconnection Networks
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly ...
متن کامل